Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM
نویسندگان
چکیده
Program libraries are one tool to make the cooperation between specialists from various elds successful: the separation of application-speci c knowledge from applicationindependent tasks ensures portability, maintenance, extensibility, and exibility. The current paper demonstrates the success in combining problem-speci c knowledge for the quadratic assignment problem (QAP) with the raw computing power o ered by contemporary parallel hardware by using the library of parallel search algorithms ZRAM. Solutions of previously unsolved large standard test-instances of the QAP are presented.
منابع مشابه
Joining Forces in Solving Large-Scale Quadratic Assignment Problems in Parallel
Program libraries are one way to make the cooperation between specialists from various fields successful: the separation of application-specific knowledge from applicationindependent tasks ensures portability, maintenance, extensibility, and flexibility. This paper demonstrates the success in combining problem-specific knowledge for the quadratic assignment problem (QAP) with the raw computing ...
متن کاملThe parallel search bench ZRAM and its applications
Distributed and parallel computation is, on the one hand, the cheapest way to increase raw computing power. Turning parallelism into a useful tool for solving new problems, on the other hand, presents formidable challenges to computer science. We believe that parallel computation will spread among general users mostly through the ready availability of convenient and powerful program libraries. ...
متن کاملZRAM: a library of parallel search algorithms and its use in enumeration and combinatorial optimization
ZRAM is a software library which renders the power of parallel computers usable for combinatorial optimization and enumeration. It provides a set of parallel search engines for branch-and-bound, reverse search, backtrack¬ ing and tree-size estimation. These search engines hide the complexity of parallelism from the application programmer. ZRAM contains the first parallel implementation of the r...
متن کاملA QAP Solver with CUDA GPU Computing Architecture A Two Page Description of the Application Submitted for GECCO 2009 Competition : GPUs for Genetic and Evolutionary Computation
This application solves the quadratic assignment problem (QAP) [1]. In QAP, we are given l locations and l facilities and the task is to assign the facilities to the locations to minimize the cost. We chose QAP for the following reasons: First, problem sizes of QAPs in real life problems are relatively small compared with other problems in permutation domains such as the traveling salesman prob...
متن کاملOn the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel
The quadratic assignment problem (QAP) belongs to the hard core of N P-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not suucient. Recently, lower bounds based on decomposition were proposed for the so called rectilinear QAP that prove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 50 شماره
صفحات -
تاریخ انتشار 1998